Frequent Items Mining Algorithm Over High Speed Network Flows Based on Double Hash Method
نویسندگان
چکیده
منابع مشابه
Frequent Items Mining Algorithm Over High Speed Network Flows Based on Double Hash Method
In the high-speed backbone network, with the increasing speed of network link, the number of network flows increase rapidly. Meanwhile, with restrictions on hardware computing and storage resources, so, how to identify and measure large flows timely and accurately in massive data become a hot issue in high speed network flow measurement area. In this paper, we propose a new algorithm based on d...
متن کاملDELAY-CFIM: A Sliding Window Based Method on Mining Closed Frequent Itemsets over High-Speed Data Streams
Closed frequent itemset mining plays an essential role in data stream mining. It could be used in business decisions, basket analysis, etc. Most methods for mining closed frequent itemsets store the streamlined information in compact data structure when data is generated. Whenever a query is submitted, it outputs all closed frequent itemsets. However, the online processing of existing approache...
متن کاملBeyond Itemsets: Mining Frequent Featuresets over Structured Items
We assume a dataset of transactions generated by a set of users over structured items where each item could be described through a set of features. In this paper, we are interested in identifying the frequent featuresets (set of features) by mining item transactions. For example, in a news website, items correspond to news articles, the features are the named-entities/topics in the articles and...
متن کاملEfficient Method for Mining Patterns from Highly Similar and Dense Database based on Prefix-Frequent-Items
In recent years, there are a great deal of efforts on sequential pattern mining, but some challenges have not been resolved, such as large search spaces and the ineffectiveness in handling highly similar, dense and long sequences. This paper mainly focuses on how to design some effective search space pruning methods to accelerate the mining process. We present a novel structure, PrefixFrequent-...
متن کاملMining Approximate Frequent Closed Flows over Packet Streams
Due to the varying and dynamic characteristics of network traffic, the analysis of traffic flows is of paramount importance for network security, accounting and traffic engineering. The problem of extracting knowledge from the traffic flows is known as the heavy-hitter issue. In this context, the main challenge consists in mining the traffic flows with high accuracy and limited memory consumpti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Future Generation Communication and Networking
سال: 2016
ISSN: 2233-7857,2233-7857
DOI: 10.14257/ijfgcn.2016.9.5.08